package com.zhujy.wy;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
;

public class Dfs_Jump {
	
	public static List<Integer> get(int n) {
		int num = (int) Math.sqrt(n);
		List res = new ArrayList<Integer>();
		for(int i=0;i<num;i++) {
			if(n%i == 0) {
				res.add(i);
				if(n/i != i) {
					res.add(n/i);
				}
			}
		}
		return res;
	}
	
	public static void toDo(int n,int m,int[] arr) {
		int tmpN = n;
		List<Integer> count = get(tmpN);
		for(int i = 0;i<count.size();i++) {
			int tmp = n+count.get(i);
			
		}
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner in = new Scanner(System.in);
		int num = 0;
		int num2 = 0;
		while(in.hasNext()) {
			num = in.nextInt();
			num2 = in.nextInt();
			int[] every = new int[num2-num+1];
			toDo(num, num2, every);
		}
	}

}
